A stronger bridge theorem
نویسندگان
چکیده
منابع مشابه
A stronger no-cloning theorem
It is well known that (non-orthogonal) pure states cannot be cloned so one may ask: how much or what kind of additional (quantum) information is needed to supplement one copy of a quantum state in order to be able to produce two copies of that state by a physical operation? For classical information, no supplementary information is required. However for pure quantum (non-orthogonal) states, we ...
متن کاملA weak variant of Hindman's Theorem stronger than Hilbert's Theorem
Hirst investigated a slight variant of Hindman's Finite Sums Theorem called Hilbert's Theorem and proved it equivalent over RCA0 to the In nite Pigeonhole Principle for all colors. This gave the rst example of a natural restriction of Hindman's Theorem provably much weaker than Hindman's Theorem itself. We here introduce another natural variant of Hindman's Theorem which we name the Adjacent Hi...
متن کاملA stronger structure theorem for excluded topological minors
Grohe and Marx [4] proved that if G does not contain H as a topological minor, then there exist constants g = O(|V (H)|4), D and t depending only on H such that G is a clique sum of graphs that either contain at most t vertices of degree greater than D or almost embed in some surface of genus at most g. We strengthen this result, giving a more precise description of the latter kind of basic gra...
متن کاملA stronger version of Bárány's theorem in the plane
First, we may assume, without loss of generality, that the points of the sets > > are located on the unit circle, by projecting these points on the circumference of the circle. Second, by Carathéodory Theorem (see [3]), we may assume, without loss of generality, that the cardinality of each set + is at most ? , for 45X2= >8 @? . In fact, we can further assume that * + * 5? , for 45X2' 98( ...
متن کاملA stronger conclusion to the classical ham sandwich theorem
The conclusion of the classical ham sandwich theorem for bounded Borel sets may be strengthened, without additional hypotheses – there always exists a common bisecting hyperplane that touches each of the sets, that is, that intersects the closure of each set. In the discrete setting, where the sets are finite (and the measures are counting measures), there always exists a bisecting hyperplane t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 1964
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm-13-2-209-210